PRESENTATIONS AND MODULE BASES OF INTEGER-VALUED POLYNOMIAL RINGS
نویسندگان
چکیده
منابع مشابه
Generalized Rings of Integer-valued Polynomials
The classical ring of integer-valued polynomials Int(Z) consists of the polynomials in Q[X] that map Z into Z. We consider a generalization of integervalued polynomials where elements of Q[X] act on sets such as rings of algebraic integers or the ring of n× n matrices with entries in Z. The collection of polynomials thus produced is a subring of Int(Z), and the principal question we consider is...
متن کاملWhat are Rings of Integer-Valued Polynomials?
Every integer is either even or odd, so we know that the polynomial f(x) = x(x− 1) 2 is integervalued on the integers, even though its coefficients are not in Z. Similarly, since every binomial coefficient ( k n ) is an integer, the polynomial ( x n ) = x(x− 1)...(x− n+ 1) n! must also be integervalued. These polynomials were used for polynomial interpolation as far back as the 17 century. Inte...
متن کاملInteger-valued Polynomials over Quaternion Rings
When D is an integral domain with field of fractions K, the ring Int(D) = {f(x) ∈ K[x] | f(D) ⊆ D} of integer-valued polynomials over D has been extensively studied. We will extend the integer-valued polynomial construction to certain noncommutative rings. Specifically, let i, j, and k be the standard quaternion units satisfying the relations i = j = −1 and ij = k = −ji, and define ZQ := {a+bi+...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملReduced Gröbner Bases in Polynomial Rings over a Polynomial Ring
We define reduced Gröbner bases in polynomial rings over a polynomial ring and introduce an algorithm for computing them. There exist some algorithms for computing Gröbner bases in polynomial rings over a polynomial ring. However, we cannot obtain the reduced Gröbner bases by these algorithms. In this paper we propose a new notion of reduced Gröbner bases in polynomial rings over a polynomial r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2012
ISSN: 0219-4988,1793-6829
DOI: 10.1142/s021949881250137x